Static Security Optimization for Real-Time Systems
نویسندگان
چکیده
منابع مشابه
Security-aware Scheduling for Real-time Systems
Over the last decade, clusters have become the fastest growing platforms in highperformance computing. More recently, Grids were emerging as next generation computing platforms for large-scale computation and data intensive problems in industry, academic, and government organizations. Meanwhile, an increasing number of real-time applications running on clusters and Grids have mandatory security...
متن کاملReal-Time Optimization Strategies for Building Systems∗
We analyze different optimization strategies for real-time energy management in building systems. We have found that exploiting building-wide multivariable interactions between CO2, humidity, pressure, occupancy, and temperature leads to significant reductions of energy intensity. Our analysis indicates that it is possible to obtain energy savings of more than 50% compared with traditional cont...
متن کاملFault-Tolerant Static Scheduling for Real-Time Distributed Embedded Systems
We present in this paper a heuristic for producing automatically a distributed fault-tolerant schedule of a given data-flow algorithm onto a given distributed architecture. The faults considered are processor failures, with a failsilent behavior. Fault-tolerance is achieved with the software redundancy of computations and the time redundancy of data-dependencies.
متن کاملStatic Timing Analysis for Hard Real-Time Systems
Hard real-time systems have to satisfy strict timing constraints. To prove that these constraints are met, timing analyses aim to derive safe upper bounds on tasks’ execution times. Processor components such as caches, out-of-order pipelines, and speculation cause a large variation of the execution time of instructions, which may induce a large variability of a task’s execution time. The archit...
متن کاملCombining Static and Dynamic Scheduling for Real-Time Systems
We address in this paper the combination of static and dynamic scheduling into an approach called quasi-static scheduling, in the context of real-time systems composed of hard and soft tasks. For the particular problem discussed in this paper, a single static schedule is too pessimistic while a purely dynamic scheduling approach causes a very high on-line overhead. In the proposed quasi-static ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Industrial Informatics
سال: 2009
ISSN: 1551-3203
DOI: 10.1109/tii.2009.2014055